S-buffer: Sparsity-aware Multi-fragment Rendering
نویسندگان
چکیده
This work introduces S-buffer, an efficient and memory-friendly gpu-accelerated A-buffer architecture for multifragment rendering. Memory is organized into variable contiguous regions for each pixel, thus avoiding limitations set in linked-lists and fixed-array techniques. S-buffer exploits fragment distribution for precise allocation of the needed storage and pixel sparsity (empty pixel ratio) for computing the memory offsets for each pixel in a parallel fashion. An experimental comparative evaluation of our technique over previous multi-fragment rendering approaches in terms of memory and performance is provided.
منابع مشابه
Deferred blending: Image composition for single-pass point rendering
In this paper, we propose novel GPU accelerated algorithms for interactive point-based rendering (PBR) and high-quality shading of transparent point surfaces. By introducing the concept of deferred blending we are able to formulate the smooth point interpolation problem as an image compositing post-processing task. Consequently, our new PBR algorithm does not suffer from an extra visibilityspla...
متن کاملThe G-Buffer Framework
The geometric buffer (G-buffer) is a well-known approach to implement imagebased rendering algorithms. We propose a framework that maps the G-buffer concept and associated image-space operations to the graphics processing unit (GPU). This GPU-G-buffer (G-buffer) framework consists of two major components: first, a texture-based representation of the G-buffer attributes; second, an implementatio...
متن کاملSingle-pass Multi-view Volume Rendering
In this paper, we introduce a new direct volume rendering (DVR) algorithm for multi-view auto-stereoscopic displays. Common multi-view methods perform multi-pass rendering (one pass for each view) and subsequent image compositing and masking for generating multiple views. The rendering time increases therefore linearly with the number of views, but sufficient frame-rates are achieved by sub-res...
متن کاملThe K-buffer and Its Applications to Volume Rendering
Harvesting the power of modern graphics hardware to solve the complex problem of real-time rendering of large unstructured meshes is a major research goal in the volume visualization community. Although for regular grids texture-based techniques are well suited for current Graphics Processing Units (GPUs), the steps necessary for rendering unstructured meshes are not so easily mapped to current...
متن کاملMerging Similarity and Trust Based Social Networks to Enhance the Accuracy of Trust-Aware Recommender Systems
In recent years, collaborative filtering (CF) methods are important and widely accepted techniques are available for recommender systems. One of these techniques is user based that produces useful recommendations based on the similarity by the ratings of likeminded users. However, these systems suffer from several inherent shortcomings such as data sparsity and cold start problems. With the dev...
متن کامل